The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
نویسندگان
چکیده
منابع مشابه
Matroid Secretary Problems
In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented with n positive values, one by one. After each value, the algorithm must either accept or reject the value, where all decisions are final. The algorithm can only pick one value, and the goal is to pick the maximum value in the sequence. The name for this problem arises from a situation where n candi...
متن کاملThe Submodular Secretary Problem
Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions without knowing future information. Optimal stopping theory, especially the classic secretary problem, is a powerful tool for analyzing such online scenarios which generally r...
متن کاملMatroid Secretary for 2-Sums
This problem is a generalization of the classical secretary problem in which numbers arrive on-line in random order and the goal is to select a number as large as possible. In the matroid secretary problem, there is a matroid with ground set E and independent sets I, and a weight function assigning a weight w(i) to each element i ∈ E. We wish to design an algorithm which the matroid (E, I) is g...
متن کاملOn the generality of the greedy algorithm for solving matroid base problems
It is well known that the greedy algorithm solves matroid base problems for all linear cost functions and is, in fact, correct if and only if the underlying combinatorial structure of the problem is a matroid. Moreover, the algorithm can be applied to problems with sum, bottleneck, algebraic sum or k-sum objective functions. In this paper, we address matroid base problems with a more general – ...
متن کاملValuated matroid-based algorithm for submodular welfare problem
An algorithm for the submodular welfare problem is proposed based on the theory of discrete convex analysis. The proposed algorithm is a heuristic method built upon the valuated matroid partition algorithms, and gives the exact optimal solution for a reasonable subclass of submodular welfare problems. The algorithm has a guaranteed approximation ratio for a special case. Computational results s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2015
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-015-9642-4